Conditioning analysis of block incomplete factorizations and its application to elliptic equations
نویسندگان
چکیده
The paper deals with eigenvalue estimates for block incomplete factorization methods for symmetric matrices. First, some previous results on upper bounds for the maximum eigenvalue of preconditioned matrices are generalized to each eigenvalue. Second, upper bounds for the maximum eigenvalue of the preconditioned matrix are further estimated, which presents a substantial improvement of earlier results. Finally, the results are used to estimate bounds for every eigenvalue of the preconditioned matrices, in particular, for the maximum eigenvalue, when a modified block incomplete factorization is used to solve an elliptic equation with variable coefficients in two dimensions. The analysis yields a new upper bound of type γh−1 for the condition number of the preconditioned matrix and shows clearly how the coefficients of the differential equation influence the positive constant γ.
منابع مشابه
Conditioning Analysis of Incomplete Cholesky Factorizations with Orthogonal Dropping
The analysis of preconditioners based on incomplete Cholesky factorization in which the neglected (dropped) components are orthogonal to the approximations being kept is presented. General estimate for the condition number of the preconditioned system is given which only depends on the accuracy of individual approximations. The estimate is further improved if, for instance, only the newly compu...
متن کاملOn the Stability of Relaxed Incomplete Lu Factorizations
When solving large linear systems of equations arising from the discretization of elliptic boundary value problems, a combination of iterative methods and preconditioners based on incomplete LU factorizations is frequently used. Given a model problem with variable coefficients, we investigate a class of incomplete LU factorizations depending on a relaxation parameter. We show that the associate...
متن کاملA Stability Analysis of Incomplete LU Factorizations
The combination of iterative methods with preconditionings based on incomplete LU factorizations constitutes an effective class of methods for solving the sparse linear systems arising from the discretization of elliptic partial differential equations. In this paper, we show that there are some settings in which the incomplete LU preconditioners are not effective, and we demonstrate that their ...
متن کاملPreconditioning By Incomplete Block Cyclic Reduction
Iterative methods for solving linear systems arising from the discretization of elliptic/parabolic partial differential equations require the use of preconditioners to gain increased rates of convergence. Preconditioners arising from incomplete factorizations have been shown to be very effective. However, the recursiveness of these methods can offset these gains somewhat on a vector processor. ...
متن کاملIncomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation
The application of the finite difference method to discretize the complex Helmholtz equation on a bounded region in the plane produces a linear system whose coefficient matrix is block tridiagonal and is some (complex) perturbation of an M-matrix. The matrix is also complex symmetric, and its real part is frequently indefinite. Conjugate gradient type methods are available for this kind of line...
متن کامل